Explicit Plethystic Formulas for Macdonald q,t-Kostka Coefficients
نویسندگان
چکیده
i=1 ti−1 (1+· · ·+qμi−1). In [8] Garsia-Tesler proved that if γ is a partition of k and λ = (n−k, γ) is a partition of n, then there is a unique symmetric polynomial kγ(x; q, t) of degree ≤ k with the property that K̃λμ(q, t) = kγ [Bμ(q, t); q, t] holds true for all partitions μ. It was shown there that these polynomials have Schur function expansions of the form kγ(x; q, t) = ∑ |ρ|≤|γ| Sλ(x) kρ,γ(q, t) where the kρ,γ(q, t) are polynomials in q, t, 1/q, 1/t with integer coefficients. This result yielded the first proof of the Macdonald polynomiality conjecture. It also was used in a proof [7] of the positivity conjecture for the K̃λμ(q, t) for any λ of the form λ = (r, 2, 1) and arbitrary μ. In this paper we show that the polynomials kγ(x; q, t) may be given a very simple explicit expression in terms of the operator ∇ studied in [2]. In particular we also obtain a new proof of the polynomiality of the coefficients K̃λμ(q, t). Further byproducts of these developments are a new explicit formula for the polynomial H̃μ[X; q, t] = ∑ λ Sλ[X]K̃λμ(q, t) and a new derivation of the symmetric function results of Sahi [16] and Knop [11], [12].
منابع مشابه
Plethystic F Ormulas For
This work is concerned with the Macdonald q;t-analogue of the Kostka matrix. This matrix relates the two parameter Macdonald basis fP x; q;tg to the modiied Schur basis fS X1 , tg. The entries in this matrix, which h a v e come to be denoted by K ; q;t, h a v e been conjectured by Macdonald to be polynomials in q;t with positive i n tegral coeecients. Our main main result here is an algorithm f...
متن کاملHall-littlewood Vertex Operators and Generalized Kostka Polynomials Mark Shimozono and Mike Zabrocki
Kostka-Folkes polynomials may be considered as coefficients of the formal power series representing the character of certain graded GL(n)-modules. These GL(n)-modules are defined by twisting the coordinate ring of the nullcone by a suitable line bundle [1] and the definition may be generalized by twisting the coordinate ring of any nilpotent conjugacy closure in gl(n) by a suitable vector bundl...
متن کاملPolynomiality of the Q, T-kostka Revisited
Let K(q, t) = K λµ (q, t) λ,µ be the Macdonald q, t-Kostka matrix and K(t) = K(0, t) be the matrix of the Kostka-Foulkes polynomials K λµ (t). In this paper we present a new proof of the polynomiality of the q, t-Kostka coefficients that is both short and elementary. More precisely, we derive that K(q, t) has entries in Z[q, t] directly from the fact that the matrix K(t) −1 has entries in Z[t]....
متن کاملComposition Kostka functions
Macdonald defined two-parameter Kostka functions Kλμ(q, t) where λ, μ are partitions. The main purpose of this paper is to extend his definition to include all compositions as indices. Following Macdonald, we conjecture that also these more general Kostka functions are polynomials in q and t with non-negative integers as coefficients. If q = 0 then our Kostka functions are Kazhdan-Lusztig polyn...
متن کاملq-Analogs of symmetric function operators
For any homomorphism V on the space of symmetric functions, we introduce an operation that creates a q-analog of V . By giving several examples we demonstrate that this quantization occurs naturally within the theory of symmetric functions. In particular, we show that the Hall-Littlewood symmetric functions are formed by taking this q-analog of the Schur symmetric functions and the Macdonald sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000